Slow adaptive OFDMA via stochastic programming

Fueled by the promises of high spectral efficiency, adaptive OFDMA has attracted enormous research interests over the last decade. The significant capacity gain of adaptive OFDMA comes from fast adaptation of resource allocation in response to instantaneous channel conditions. Despite years of efforts to improve the practicality of adaptive OFDMA, such promising technique is still far from real implementation due to the prohibitively high computational complexity and excessive control overhead. This paper is an endeavor to address the problem by proposing a slow adaptation scheme, where resource allocation is adapted on a much slower time scale than the fluctuation of wireless channel fading. Specifically, the slow adaptive OFDMA is formulated into a stochastic programming problem, which adapts resource allocation according to the channel statistics within an adaptation window rather than according to instantaneous channel conditions. By tuning the length of the adaptation window, we could engineer a desirable tradeoff between spectral efficiency and computational complexity. Furthermore, the proposed scheme can be modified to accommodate inelastic traffics. The modification, referred to as “safe” slow adaptation, ensures worst-case data rates to all users. In this work, safe slow adaptation is formulated into a conic linear program, which is efficiently solved via interior-point methods. Through extensive simulations, we show that the proposed schemes drastically reduce the computational complexity and control overheads, while achieving satisfactorily high spectral efficiency and QoS provisioning as their fast-adaptation counterpart does with a much higher cost.